<HTML>
<HEAD>
<!-- This HTML file has been created by texi2html 1.45
     from schintro.txi on 19 Febuary 1997 -->

<TITLE>An Introduction to Scheme and its Implementation - Pairs and Lists</TITLE>
</HEAD>
<BODY>
Go to the <A HREF="schintro_1.html">first</A>, <A HREF="schintro_35.html">previous</A>, <A HREF="schintro_37.html">next</A>, <A HREF="schintro_143.html">last</A> section, <A HREF="schintro_toc.html">table of contents</A>.
<HR>


<H2><A NAME="SEC38" HREF="schintro_toc.html#SEC38">Pairs and Lists</A></H2>

<P>
<A NAME="IDX28"></A>
<A NAME="IDX29"></A>
<A NAME="IDX30"></A>
<A NAME="IDX31"></A>

</P>
<P>
Scheme, like Lisp, has built-in procedures for dealing with a
particularly flexible kind of list--a list of pairs, whose
<CODE>cdr</CODE> fields hold pointers that string them together, and whose 
<CODE>car</CODE> fields hold the values.  (That is, the <CODE>cdr</CODE> fields
act as "next" pointers, linking the pairs into a linear list.)

</P>

<UL>
<LI><A HREF="schintro_37.html#SEC39">cdr-linked lists</A>: Null-terminated lists of pairs linked by cdrs,
                       whose cars hold references to items.
<LI><A HREF="schintro_38.html#SEC40">Lists and Quoting</A>: Literal lists
<LI><A HREF="schintro_39.html#SEC41">Where the Empty List Got its Name</A>: Why it's called that, and printed (),
                       and written '() as a literal
<LI><A HREF="schintro_40.html#SEC42">Some Handy Procedures that Operate on Lists</A>: length, list, append, and reverse
</UL>

<HR>
Go to the <A HREF="schintro_1.html">first</A>, <A HREF="schintro_35.html">previous</A>, <A HREF="schintro_37.html">next</A>, <A HREF="schintro_143.html">last</A> section, <A HREF="schintro_toc.html">table of contents</A>.
</BODY>
</HTML>
